package dp;

/**
 * 583. 两个字符串的删除操作
 * 创建时间：2024/6/28 下午1:55
 * 这一题其实就是 1143.最长公共子序列 的变种
 */
public class 两个字符串的删除操作_583 {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            char t1 = word1.charAt(i - 1);
            for (int j = 1; j <= n; j++) {
                char t2 = word2.charAt(j - 1);
                if (t1 == t2) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return m + n - dp[m][n] * 2;
    }
}
